Probabilistic Modelling in Multi-Competitor Games
نویسنده
چکیده
Previous studies in to predictive modelling of sports have largely concentrated on those which belong to the group of sports and games which can be termed as one-on-one: those where teams or players face each other in pairs e.g. football, basketball and tennis. Here the case of multi-competitor games or sports such golf, horse racing and motor sport, which are defined as ones in which three or more players or teams compete against each other at the same time are considered. Models, which given data in the form of previous performance of players, can make probabilistic predictions on the outcome of future tournaments are investigated. The generalised Bradley-Terry model for repeated multiple rankings of individuals known as the Plackett-Luce model is reviewed. A two-way anova model which uses scores rather than rankings is proposed as an alternative more suited for specific application to sports data. A dynamic extension and Kalman filter approach to fitting data to the two-way anova model is described. The models are firstly developed and tested on artificially generated 'toy' data then are applied to real world data in the form of seven years worth of US PGA tour records. Findings from this study are presented in the form of a comparison of the static models with the Official Golf World Rankings and a case study of the dynamic analysis of two players. A quantitative evaluation of the predictive performance of the models is presented in the form of results from their application in a gambling scenario. The dynamic two-way anova model is found to be competitive in its predictions when compared to those of a human expert.
منابع مشابه
Model Checking and Strategy Synthesis for Stochastic Games: From Theory to Practice
Probabilistic model checking is an automatic procedure for establishing if a desired property holds in a probabilistic model, aimed at verifying quantitative probabilistic specifications such as the probability of a critical failure occurring or expected time to termination. Much progress has been made in recent years in algorithms, tools and applications of probabilistic model checking, as exe...
متن کاملPRISM-games: A Model Checker for Stochastic Multi-Player Games
We present PRISM-games, a model checker for stochastic multi-player games, which supports modelling, automated verification and strategy synthesis for probabilistic systems with competitive or cooperative behaviour. Models are described in a probabilistic extension of the Reactive Modules language and properties are expressed using rPATL, which extends the well-known logic ATL with operators to...
متن کاملA stochastic rank ordered logit model for rating multi-competitor games and sports
Many games and sports, including races, involve outcomes in which competitors are rank ordered. In some sports, competitors may play in multiple events over long periods of time, and it is natural to assume that their abilities change over time. We propose a Bayesian state-space framework for rank ordered logit models to rate competitor abilities over time from the results of multi-competitor g...
متن کاملSolving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملDiscrete Nondeterminism and Nash Equilibria for Strategy-Based Games
Several notions of game enjoy a Nash-like notion of equilibrium without guarantee of existence. There are different ways of weakening a definition of Nash-like equilibrium in order to guarantee the existence of a weakened equilibrium. Nash’s approach to the problem for strategic games is probabilistic, i.e. continuous, and static. CP and BR approaches for CP and BR games are discrete and dynami...
متن کامل